Secrecy-preserving Query Answering for Instance Checking in EL
نویسندگان
چکیده
We consider the problem of answering queries against a knowledge base (KB) using secrets, whenever it is possible to do so without compromising secrets. We study query answering against EL knowledge bases. We provide a polynomial time algorithm that, given an EL KB Σ, a set S of secrets to be protected and a query q or the form C(a) or r(a, b), outputs “Yes” whenever Σ q and the answer to q, together with the answers to any previous queries answered by the KB, does not allow the querying agent to deduce any of the secrets in S. This approach allows more flexible information sharing than is possible with traditional access control mechanisms.
منابع مشابه
Secrecy-Preserving Query Answering for Instance Checking in EL\mathcal{EL}
We consider the problem of answering queries against a knowledge base (KB) using secrets, whenever it is possible to do so without compromising secrets. We study query answering against EL knowledge bases. We provide a polynomial time algorithm that, given an EL KB Σ, a set S of secrets to be protected and a query q or the form C(a) or r(a, b), outputs “Yes” whenever Σ q and the answer to q, to...
متن کاملEfficient Query Answering over Fuzzy EL-OWL Based on Crisp Datalog Rewritable Fuzzy EL++
OWL EL is an extension of the tractable EL description logic. Despite their inference capabilities over TBoxes, DL reasoners have a high ABox reasoning complexity which may constitute a serious limitation in the Semantic Web where we rely mainly on query answering (i.e. instance checking). The subsomption algorithm used in fuzzy EL reduce instance checking into concept satisfiability. To allow ...
متن کاملOn Conjunctive Query Answering in EL
In this paper we study conjunctive query answering in the description logics of the EL family [2, 3, 7, 6, 5], in particular we consider the DLs EL, ELH, EL, and EL. The EL family has been recently defined in order to identify DLs both having interesting expressive abilities and allowing for tractable reasoning. While the standard reasoning tasks (like concept subsumption and instance checking)...
متن کاملData Complexity in the EL Family of Description Logics
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability. We identify a large number of intractable extensions of EL, but also show that in ELI , the extension of EL with inverse roles and global functionality, conjunctive query answering is tractable regarding data comple...
متن کاملData Complexity in the EL family of DLs
In recent years, lightweight description logics (DLs) have experienced increased interest because they admit highly efficient reasoning on large-scale ontologies. Most prominently, this is witnessed by the ongoing research on the DL-Lite and EL families of DLs, but see also [11, 14] for other examples. The main application of EL and its relatives is as an ontology language [5, 1, 3]. In particu...
متن کامل